A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem
نویسنده
چکیده
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves the hitherto best-known solution, which has a running time of 0( m + n log n), where m and n are the number of edges and vertices of the graph.
منابع مشابه
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs
Chang, MS., C.Y. Tang and R.C.T. Lee, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs, Discrete Applied Mathematics 39 (1992) 1-12. In this paper, we discuss the Euclidean bottleneck biconnected edge subgraph problem. We shall first define a k-relative neighborhood graph which is similar to the relative neighborhood graph first proposed by To...
متن کاملOn Finding Minimal Two-Connected Subgraphs
Wepresent e cient parallel algorithms for the problems of nding a minimal2-edge-connected spanning subgraph of a 2-edge-connected graph and nding a minimalbiconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM processors. We also give linear time sequential algorithms for minimally augmenting a spanning tree into a 2-edge-...
متن کاملA Polyhedral Approach to Planar Augmentation and Related Problems
Given a planar graph G the planar biconnectivity augmen tation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected Given a nonplanar and biconnected graph the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained Both problems are imp...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملApproximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 59 شماره
صفحات -
تاریخ انتشار 1996